12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)

نویسندگان

  • Johann Hurink
  • Bodo Manthey
چکیده

Weare pleased to present this special issue ofDiscrete AppliedMathematics, which is devoted to the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2013), held at the University of Twente, Enschede, The Netherlands, between May 21 and May 23, 2013. More than 80 scientists from all over the world attended the workshop, and we take this opportunity to thank all CTW 2013 participants for their presentations and lively discussions at the workshop. After the workshop, we invited the participants and the community at large to submit manuscripts with research results related to the themes and topics of the workshop. From the submitted manuscripts, we have selected, after a careful refereeing process, twelve articles to be included in this special issue. We thank the reviewers for their insightful reports and the authors for the quality of their contributions. Special thanks are due to Endre Boros, Editor-in-Chief, who accepted to host this issue dedicated to CTW 2013 in Discrete Applied Mathematics, thereby following a long tradition. We also thank Katie D’Agosta, Publications Manager, for her help and valuable support. The CTW started as a series of biennial meetings at the Universities of Cologne in Germany and Twente in the Netherlands. Ever-increasing interest has turned the CTW into a now annual event with several other universities as additional partners. The scope of the workshop comprises the theory and applications of discrete algorithms, graphs, and combinatorial structures in a broad sense. We hope for a continuing interest in these CTW workshops and are looking forward to contributions in the future from all interested researchers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Enschede, Netherlands, May 21-23, 2013

Locations Sessions. All technical sessions take place in the Vrijhof (building 47 on the campus map) in the lecture halls Amphitheater and Audiozaal. Internet You can use " eduroam " to connect to the internet. If you have internet access in your hotel on the campus and have obtained an account for that purpose, you can use the " UT Guest " network. If neither of these options works, you can us...

متن کامل

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009

We present two approaches for the Euclidean TSP which compute high quality tours for large instances. Both approaches are based on pseudo backbones consisting of all common edges of good tours. The first approach starts with some pre-computed good tours. Using this approach we found record tours for seven VLSI instances. The second approach is window based and constructs from scratch very good ...

متن کامل

CTW 16 14 th Cologne - Twente Workshop on Graphs and Combinatorial Optimization Università degli

The shared broadcast tree (SBT) problem in Euclidean graphs resembles the minimum spanning tree (MST) problem, but differs from MST in the definition of the objective function. The SBT problem is known to be NP-hard. In the current work, we analyse how closely the MST-solution approximates the SBT-solution, and we prove in particular that the approximation ratio is at least 6. Further, we condu...

متن کامل

Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, gargano, Italy, 13-15 May, 2008

Let H and G be graph classes. We say that H has the Erdős-Pósa property for G if for any graph G ∈ G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). In his monograph “Graph Theory”, R. Diestel proves that if H is the class of all graphs that can be contrac...

متن کامل

Welcome to the 6 th COLOGNE TWENTE WORKSHOP ON GRAPHS

This volume collects the extended abstracts of the contributions that have been selected for presentation at the Workshop. As it was the case with previous workshops, we are planning to edit a special , fully refereed, proceedings volume with Discrete Applied Mathematics or Discrete Optimization and hereby invite all participants to submit full-length papers relating to the topics of the Worksh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 195  شماره 

صفحات  -

تاریخ انتشار 2015